Confounding Values in Decision Trees Constructed for Six Otoneurological Diseases
نویسندگان
چکیده
In this study, we examined the effect of example cases with confounding values on decision trees constructed for six otoneurological diseases involving vertigo. The six diseases were benign positional vertigo, Menière’s disease, sudden deafness, traumatic vertigo, vestibular neuritis, and vestibular schwannoma. Patient cases with confounding values were inserted into original vertigo data and decision trees were constructed. Confounding values made classification tasks more difficult and decreased true positive rates and accuracies of decision trees. Despite decreased true positive rates and accuracies, new decision trees organised confounding values in a reasonable way into the reasoning process. The occurrence of confounding values simulates better the real life classification tasks.
منابع مشابه
On Machine Learning Classification of Otoneurological Data
A dataset including cases of six otoneurological diseases was analysed using machine learning methods to investigate the classification problem of these diseases and to compare the effectiveness of different methods for this data. Linear discriminant analysis was the best method and next multilayer perceptron neural networks provided that the data was input into a network in the form of princip...
متن کاملFuzzy If-then Rule Induction with Cumulative Information Estimations Applied to Real-world Data
Real-world data containing instances corresponding to patients with otoneurological diseases were explored with fuzzy IFTHEN rule induction. It was based on transformation of a fuzzy decision tree made with using cumulative information estimations as the locally optimal criterion at its nodes. This method uses linguistic variables that allow us to naturally model various situations appearing in...
متن کاملDynamic Programming Approach for Study of Decision Trees
In the presentation, we consider extensions of dynamic programming approach to the study of decision trees as algorithms for problem solving, as a way for knowledge extraction and representation, and as classifiers which, for a new object given by values of conditional attributes, define a value of the decision attribute. These extensions allow us (i) to describe the set of optimal decision tre...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملComparison of Ordinal Response Modeling Methods like Decision Trees, Ordinal Forest and L1 Penalized Continuation Ratio Regression in High Dimensional Data
Background: Response variables in most medical and health-related research have an ordinal nature. Conventional modeling methods assume predictor variables to be independent, and consider a large number of samples (n) compared to the number of covariates (p). Therefore, it is not possible to use conventional models for high dimensional genetic data in which p > n. The present study compared th...
متن کامل